triangular decompositionの例文

• The regular semi-algebraic systems form a "'triangular decomposition "'of the semi-algebraic system.
• This is a notable difference with triangular decompositions ( even the equiprojectable decomposition ), which, in general, do not preserve multiplicities.
• There are various algorithms available for obtaining triangular decomposition of both in the sense of Kalkbrener and in the sense of Lazard and Axiom.
• If the coefficient of are real numbers, then the real solutions of can be obtained by a triangular decomposition into regular semi-algebraic systems.
• There are several algorithms for computing a triangular decomposition of an arbitrary polynomial system ( not necessarily zero-dimensional ) into regular chains ( or regular semi-algebraic systems ).
• S . K . Sen, On an automatic computation of the determinant of a matrix A and of the solution vector x in Ax = b using triangular decomposition with minimum possible storage, Proc.
• Jurisich (, ) found that the homology computation could be substantially shortened by replacing the usual triangular decomposition of the Monster Lie algebra with a decomposition into a sum of " gl " 2 and two free Lie algebras.
• S . K . Sen, Nonconventional triangular decomposition schemes for matrix inversion and solution of linear equations, Computer Science and Informatics ( J . of Computer Soc . of India ), 3, 1, 1972, 5  8.